A stochastic model for the number of fixed points of a Welch Costas permutation
نویسنده
چکیده
Exploiting the empirical observation that the probability of k fixed points in a Welch Costas permutation is approximately the same as in a random permutation of the same order, we propose a stochastic model for the most probable maximal number of fixed points in a Welch Costas permutation.
منابع مشابه
PERMUTATION GROUPS WITH BOUNDED MOVEMENT ATTAINING THE BOUNDS FOR ODD PRIMES
Let G be a transitive permutation group on a set ? and let m be a positive integer. If no element of G moves any subset of ? by more than m points, then |? | [2mp I (p-1)] wherep is the least odd primedividing |G |. When the bound is attained, we show that | ? | = 2 p q ….. q where ? is a non-negative integer with 2 < p, r 1 and q is a prime satisfying p < q < 2p, ? = 0 or 1, I i n....
متن کاملThree challenges in Costas arrays
We present 3 open challenges in the field of Costas arrays. They are: a) the determination of the number of dots on the main diagonal of a Welch array, and especially the maximal such number for a Welch array of a given order; b) the conjecture that the fraction of Welch arrays without dots on the main diagonal behaves asymptotically as the fraction of permutations without fixed points and henc...
متن کاملComparing the Bidirectional Baum-Welch Algorithm and the Baum-Welch Algorithm on Regular Lattice
A profile hidden Markov model (PHMM) is widely used in assigning protein sequences to protein families. In this model, the hidden states only depend on the previous hidden state and observations are independent given hidden states. In other words, in the PHMM, only the information of the left side of a hidden state is considered. However, it makes sense that considering the information of the b...
متن کاملON THE SPECTRUM OF DERANGEMENT GRAPHS OF ORDER A PRODUCT OF THREE PRIMES
A permutation with no fixed points is called a derangement.The subset $mathcal{D}$ of a permutation group is derangement if all elements of $mathcal{D}$ are derangement.Let $G$ be a permutation group, a derangementgraph is one with vertex set $G$ and derangement set $mathcal{D}$ as connecting set. In this paper, we determine the spectrum of derangement graphs of order a product of three primes.
متن کاملModeling and solving a three-stage fixed charge transportation problem considering stochastic demand and price
This paper considers a three-stage fixed charge transportation problem regarding stochastic demand and price. The objective of the problem is to maximize the profit for supplying demands. Three kinds of costs are presented here: variable costs that are related to amount of transportation cost between a source and a destination. Fixed charge exists whenever there is a transfer from a source to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ars Comb.
دوره 92 شماره
صفحات -
تاریخ انتشار 2009